An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures•
نویسنده
چکیده
An overview of hierarchical data structures for representing images, such as the quadtree and octree, is presented. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in computer graphics, computer-aided design, robotics, computer vision, and cartography. There is a greater emphasis on region data (i.e., 2-dimensional shapes) and to a lesser extent on point, lin.e, and 3-dimension-al data.
منابع مشابه
Parallel Manipulations of Octrees and Quadtrees
Octrees o er a powerful means for representing and manip ulating D objects This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture Octrees are hierarchical data structures used to model D objects The manipulation of these data structures involves performing independent computations on each node of the octree Octrees are much easier to d...
متن کامل300 Balanced Aspect Ratio Trees : : Combining the Advantages of k - d Trees ( and Octrees CHRISTIAN
Given a set S of n points in lRd, we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition tree on S that has O(logn) depth and in which every region is convex and “fat” (that is, has a bounded aspect ratio). While previous hierarchical data structures, such as k-d trees, quadtrees, octrees, f...
متن کاملBalanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
Given a set S of n points on d, we show, for fixed d, how to construct in Ž . Ž . O n log n time a data structure we call the balanced aspect ratio BAR tree. A Ž . BAR tree is a binary space partition tree on S that has O log n depth in which Ž . every region is convex and ‘‘fat’’ that is, has a bounded aspect ratio . While previous hierarchical data structures such as k-d trees, quadtrees, oct...
متن کاملSimplex and Diamond Hierarchies: Models and Applications
Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains. Several papers on this subject deal with hierarchical simplicial decompositions generated through regular simplex bisection. Such decompositions, originally developed for finite elements, are extensively used as the basis for multiresolution models of scalar fields, such as terrains, and static or...
متن کاملSpatial Data Structures
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Such techniques are known as spatial indexing methods. Hierarchical data structures are based on the principle of recursive decomposition. They are attractive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988